An Efficient Route Selection based on AODV Algorithm for VANET
نویسندگان
چکیده
منابع مشابه
An Efficient Clustering Algorithm for Vanet
Vehicular Ad hoc Network (VANET) is a subclass of mobile Ad Hoc network. VANET has become an active area of research to improve the safety of vehicle and road, traffic efficiency, and also to increase the comfort to both drivers and passengers. Due to the high mobility and dynamism, routing the messages to their final destination in VANETs is a challenging task. These issues can be addressed by...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملRoute Reinforcement for Efficient QoS Routing Based on Ant Algorithm
In this paper, we present a new method to calculate reinforcement value in QoS routing algorithm for real-time multimedia based on Ant algorithm to efficiently and effectively reinforce ant-like mobile agents to find the best route toward destination in a network. Simulation results show that the proposed method realizes QoS routing more efficiently and more adaptively than those of the existin...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملAn efficient gene selection algorithm based on mutual information
Gene selection, a significant preprocessing of the discriminant analysis of microarray data, is to select the most informative genes from the whole gene set. In this paper, an efficient mutual informationbased gene selection algorithm (MIGS) is proposed, in which genes are sequentially forward selected according to an approximate measure of the mutual information between the class and the selec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indian Journal of Science and Technology
سال: 2016
ISSN: 0974-5645,0974-6846
DOI: 10.17485/ijst/2016/v9i38/97778